SYNTHESIS OF RELIABLE NON-BRANCHING PROGRAMMES WITH A CONDITIONAL STOP
AT A FULL FINITE BASIS INCLUDING X ₁ & X ₂

Grabovskaya Svetlana Mikhaylovna, Assistant, sub-department of discrete mathematics, Penza State University, swetazin@mail.ru

519.718

The problem of synthesis of nobranching programs with conditional stop-operator is considered in full finite basis, contained X₁ &X₂. All functional operators are supposed to be prone output inverse failures. This problem is solved for two cases: 1) conditional stop-operator is absolutely reliable; 2) conditional stop-operator is unreliable.

boolean functions, nobraching programs, conditional stop-operator, synthesis, reliability.